Promovieren mit Exzellenz : Humboldt graduate school : Graduate schools = Promouvoir l'excellence : Humboldt graduate school : Ecoles doctoralesPRÖMEL, Hans Jürgen; MÜLLER, Mirjam.Humboldt-Spektrum. 2007, Vol 14, Num 1, pp 18-22, issn 0946-641X, 5 p.Article

On the evolution of the worst-case OBDD sizeGRÖPL, Clemens; PRÖMEL, Hans Jürgen; SRIVASTAV, Anand et al.Information processing letters. 2001, Vol 77, Num 1, pp 1-7, issn 0020-0190Article

Random graphs, random triangle-free graphs, and random partial ordersPRÖMEL, Hans Jürgen; TARAZ, Anusch.Computational discrete mathematics (advanced lectures). Lecture notes in computer science. 2001, pp 98-118, issn 0302-9743, isbn 3-540-42775-9Book Chapter

Large numbers, Knuth's arrow notation, and Ramsey theory = Les grands nombres, la notation de la flèche chez Knuth et la théorie de RamseyPRÖMEL, Hans Jürgen.Synthese (Dordrecht). 2002, Vol 133, Num 1-2, pp 87-105, issn 0039-7857, 19 p.Conference Paper

Steiner trees in uniformly quasi-bipartite graphsGRÖPL, Clemens; HOUGARDY, Stefan; NIERHOFF, Till et al.Information processing letters. 2002, Vol 83, Num 4, pp 195-200, issn 0020-0190Article

Ordered binary decision diagrams and the Shannon effectGRÖPL, Clemens; PRÖMEL, Hans Jürgen; SRIVASTAV, Anand et al.Discrete applied mathematics. 2004, Vol 142, Num 1-3, pp 67-85, issn 0166-218X, 19 p.Article

Introduction to the theory of complexity and approximation algorithmsJANSEN, T.Lecture notes in computer science. 1998, pp 5-28, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Proof checking and non-approximabilityHOUGARDY, S.Lecture notes in computer science. 1998, pp 63-82, issn 0302-9743, isbn 3-540-64201-3Conference Paper

DerandomizationSIELING, D.Lecture notes in computer science. 1998, pp 41-61, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Introduction to randomized algorithmsANDRZEJAK, A.Lecture notes in computer science. 1998, pp 29-39, issn 0302-9743, isbn 3-540-64201-3Conference Paper

The hardness of approximating set coverWOLFF, A.Lecture notes in computer science. 1998, pp 249-262, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Lower bounds for approximation algorithms for the Steiner tree problemGRÖPL, Clemens; HOUGARDY, Stefan; NIERHOFF, Till et al.Lecture notes in computer science. 2001, pp 217-228, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Deriving non-approximability results by reductionsRICK, C; RÖHRIG, H.Lecture notes in computer science. 1998, pp 213-233, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Optimal non-approximability of MAXCLIQUEMUNDHENK, M; SLOBODOVA, A.Lecture notes in computer science. 1998, pp 235-248, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Polynomial time approximation schemes for geometric optimization problems in Euclidean metric spacesMAYR, R; SCHELTEN, A.Lecture notes in computer science. 1998, pp 313-323, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Bounds for approximating MAXLINEQ3-2 and MAXEκSATSEIBERT, S; WILKE, T.Lecture notes in computer science. 1998, pp 179-211, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Parallel repetition of MIP(2,1) systemsGRÖPL, C; SKUTELLA, M.Lecture notes in computer science. 1998, pp 161-177, issn 0302-9743, isbn 3-540-64201-3Conference Paper

Proving the PCP-theoremHEUN, V; MERKLE, W; WEIGAND, U et al.Lecture notes in computer science. 1998, pp 83-160, issn 0302-9743, isbn 3-540-64201-3Conference Paper